Is a recursive function - it accepts a node set in the 是一個(gè)遞歸函數(shù),它用
Non - recursive simulation on recursive function 遞歸函數(shù)的非遞歸模擬
But walking a tree just by using recursive functions is not all that difficult 但是只用遞歸函數(shù)來(lái)遍歷樹并不十分困難。
In addition , recursive functions add significant expressive power to the language 此外,遞歸函數(shù)也增強(qiáng)了語(yǔ)言的表達(dá)能力。
This can be especially useful when you are debugging a recursive function , a function that calls itself 在調(diào)試遞歸函數(shù)(調(diào)用自身的函數(shù))時(shí),這個(gè)功能尤其有用。
Instead , the transformation from tail - recursive function to simple loop must be done dynamically by a jit compiler 相反地,這種從尾遞歸函數(shù)到簡(jiǎn)單循環(huán)的轉(zhuǎn)換必須由jit編譯器動(dòng)態(tài)地進(jìn)行。
You must iterate through the controls of each container control separately ; this can be done using a recursive function 必須分別循環(huán)訪問(wèn)每個(gè)容器控件的控件;可使用遞歸函數(shù)完成此操作。
Like recursive function , recursive sql for db2 express can recursively use the result set to get to the final result 與遞歸函數(shù)類似, db2 express的遞歸sql可遞歸地使用結(jié)果集來(lái)得到最終結(jié)果
But although it is well known how to automatically transform a tail - recursive function into a simple loop , the java specification doesn t require that this transformation be made 但是,盡管大家都熟知如何把一個(gè)尾遞歸函數(shù)自動(dòng)轉(zhuǎn)換成一個(gè)簡(jiǎn)單循環(huán), java規(guī)范卻不要求做這種轉(zhuǎn)換。
Lfc is a formal specification language based on recursive functions defined on context free languages ( cfrf ) and supports the acquisition and validation of formal specification very well 同時(shí)lfc也是一種函數(shù)式語(yǔ)言,具有良好的數(shù)學(xué)基礎(chǔ)、引用透明、無(wú)副作用、模式匹配等特點(diǎn)。